mcsta - firewire-pta eventually 30-5000

Benchmark

Model:	firewire-pta v.1 (PTA)
Parameter(s)	delay = 30, T = 5000
Property:	eventually (prob-reach)

Invocation (default)

mcsta/modest mcsta firewire-pta.jani -E delay=30,T=5000 --props eventually -O out.txt Minimal --unsafe --es -S Memory --epsilon 0

Execution

Walltime:	21.956027269363403s
Return code:	0
Relative Error:	0.0

Log

firewire-pta.jani:model: info: firewire-pta is a PTA model.
firewire-pta.jani:variables[3]: info: Expanding variable "w12" into 10 locations in automaton "wire12".
firewire-pta.jani:variables[6]: info: Expanding variable "s1" into 9 locations in automaton "node1".
firewire-pta.jani:variables[8]: info: Expanding variable "w21" into 10 locations in automaton "wire21".
firewire-pta.jani:variables[11]: info: Expanding variable "s2" into 9 locations in automaton "node2".
firewire-pta.jani: info: Need 24 bytes per state.
firewire-pta.jani: info: Explored 4432272 states for delay=30, T=5000.

Peak memory usage: 1131 MB
Analysis results for firewire-pta.jani
Experiment delay=30, T=5000

+ State space exploration
  State size:  24 bytes
  States:      4432272
  Transitions: 5529800
  Branches:    5533832
  Rate:        361435 states/s
  Time:        12.6 s

+ Property eventually
  Probability: 1
  Bounds:      [1, 1]
  Time:        8.7 s

  + Essential states
    Iterations:       32
    Essential states: 492859
    Transitions:      1005203
    Branches:         1009235
    Time:             3.4 s

  + Value iteration
    Final error: 0
    Iterations:  220
    Time:        5.3 s

Exported results to file "/out.txt".

STDERR

The Modest Toolset (www.modestchecker.net), version v3.1.42-gb5e9d523c.